Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Communication aware multiple directed acyclic graph scheduling considering cost and fairness
WANG Yuxin, CAO Shijie, GUO He, CHEN Zheng, CHEN Xin
Journal of Computer Applications    2015, 35 (11): 3017-3020.   DOI: 10.11772/j.issn.1001-9081.2015.11.3017
Abstract636)      PDF (757KB)(868)       Save
Multiple Directed Acyclic Graphic (DAG) scheduling algorithms are supposed to take many factors into account, such as execution time, communication overhead, cost and fairness of all DAG. Therefore, in order to increase fairness and reduce cost, a new scheduling strategy CAFS (Communication Aware Fair Scheduling), based on CA-DAG (Communication Aware-DAG), was proposed. Also, a BD (Backward Difference) rule was introduced to optimize finish time of all DAGs. CAFS is consisted of two parts: the pre-scheduling part adopts CACO (Communication Aware Cost Optimization) to optimize the total cost, and utilizes the classical fairness algorithm to decide the sequence for scheduling. Based on the sequence the second part schedules all the DAGs using BD rule to reduce the finish time. The simulation results show that CAFS can reduce the finish time without increasing cost and guarantee the fairness, and the average execution time has been reduced by 19.82%.
Reference | Related Articles | Metrics